A Priority based SRM Algorithm for VOQ Packet Switch Architecture
نویسندگان
چکیده
منابع مشابه
A 2-stage matching scheduler for a VOQ packet switch architecture
Virtual Output Queuing (VOQ) is a practical and high-performance packet switch architecture. There are many simple iterative arbitration algorithms proposed for the VOQ architecture. These algorithms either employ a 3-phase or a 2phase hand-shaking scheme between the switch inputs and outputs. It has been shown that neither scheme can outperform the other in all traffic patterns. As a result, w...
متن کاملMSMPS Packet Scheduling Algorithm for VOQ Switches
In this paper we present Maximal Size Matching with Permanent Selection (MSMPS) algorithm [1] which is responsibilities for circuit switching control. We discussed the general algorithm rules and circuit switching architecture which was used in our research. This switch architecture uses Virtual Output Queues (VOQ) for buffering incoming packets. MSMPS algorithm based on permanent connections b...
متن کاملThe Quantitative Analysis of Round Robin Matching Scheduling Algorithms for VOQ Packet Switch Architecture
Virtual output queue is the pragmatic and high performance packet switching architecture used to eliminate head-of-line (HOL) problem. There are some simple iterative algorithms proposed for the virtual output queue architecture and lot of research has been done. The detailed simulated analysis of iSlip, FIRM and maximum size matching algorithm called Static round robin (SRR) is investigated in...
متن کاملAWG Based Optical Packet Switch Architecture
This paper discusses an optical packet switch (OPS) arch itecture, which utilizes the components like optical reflectors, tunable wavelength converters (TWCs), arrayed waveguide grating (AW G) and pieces of fiber to realize the switching action. This architecture uses routing pattern of AW G, and its symmetric nature, to simplify switch operation significantly. It is also shown that using multi...
متن کاملA Packet Switch with a Priority Scheduling Discipline: Performance Analysis
In this paper, we analyze a discrete-time GI-G1, Geo2-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. The high-priority class contains packets with generally distributed service times while the low-priority packets are assumed to have geometrically distributed service times. We show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8811-3128